回溯法（2）

最新推荐文章于 2024-05-25 17:05:33 发布

为不为

最新推荐文章于 2024-05-25 17:05:33 发布

阅读量166

点赞数

分类专栏：算法

本文链接：https://blog.csdn.net/u011747152/article/details/78351278

版权

算法专栏收录该内容

102 篇文章 0 订阅

订阅专栏

原题：

/**
 * Created by pradhang on 3/8/2017.
 * Given two integers n and k, return all possible combinations of k numbers out of 1 ... n.
 * <p>
 * For example,
 * If n = 4 and k = 2, a solution is:
 * <p>
 * [
 * [2,4],
 * [3,4],
 * [2,3],
 * [1,2],
 * [1,3],
 * [1,4],
 * ]
 */

答案：


public class Combinations {

    public static void main(String[] args) throws Exception {
        List<List<Integer>> result = new Combinations().combine(3, 3);
    }

    public List<List<Integer>> combine(int n, int k) {
        int[] subArr = new int[k];
        List<List<Integer>> result = new ArrayList<>();
        getNext(0, 0, n, k, subArr, result);
        return result;
    }

    private void getNext(int i, int count,
                         int n, int k, int[] subArr, List<List<Integer>> result) {
        if (k == 0) {
            List<Integer> subList = new ArrayList<>();
            for (int a : subArr)
                subList.add(a);
            result.add(subList);
        } else {
            for (int j = i + 1; j <= n; j++) {
                subArr[count] = j;
                getNext(j, count + 1, n, k - 1, subArr, result);
            }
        }
    }
}